Zero Assignment Problem in RLC Networks

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Zero Assignment Problem in RLC Networks

The paper deals with the problem of zero assignment in RLC networks by selection of appropriate values for the nondynamical elements, the resistors. For a certain family of network redesign problems by the additive perturbations may be described as diagonal perturbations and such modifications are considered here. This problem belongs to the family of DAP problems (Determinantal Assignment Prob...

متن کامل

Node Assignment Problem in Bayesian Networks

This paper deals with the problem of searching for the best assignments of random variables to nodes in a Bayesian network (BN) with a given topology. Likelihood functions for the studied BNs are formulated, methods for their maximization are described and, finally, the results of a study concerning the reliability of revealing BNs’ roles are reported. The results of BN node assignments can be ...

متن کامل

A Geometric Assignment Problem for Robotic Networks

In this chapter we look at a geometric target assignment problem consisting of an equal number of mobile robotic agents and distinct target locations. Each agent has a fixed communication range, a maximum speed, and knowledge of every target’s position. The problem is to devise a distributed algorithm that allows the agents to divide the target locations among themselves and, simultaneously, le...

متن کامل

Parallelizing Assignment Problem with DNA Strands

Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...

متن کامل

A Routing and Spectrum Assignment Problem in Optical OFDM Networks

—Optical Orthogonal Frequency Division Multiplexing (O-OFDM) is a novel and attractive modulation technology enabling exible sub-wavelength and super-channel transmission in optical networks. In an OFDM-based optical network with elastic bandwidth provisioning, the problem of Routing and Spectrum Assignment (RSA) emerges. RSA is NP-hard and it can be computationally exhaustive even for small ne...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IFAC-PapersOnLine

سال: 2016

ISSN: 2405-8963

DOI: 10.1016/j.ifacol.2016.07.502